Slight improvements of the Singleton bound
نویسنده
چکیده
The problem of determining Aq(n, d), the maximum cardinality of a q-ary code of length n with minimum distance at least d, is considered in some cases where corresponding MDS codes do not exist. Slight improvements of the Singleton bound are given, including Aq(q + 2, q) q3 − 3 if q is odd, A5(7, 5) 53 − 4 and A16(18, 15) 184 − 4. © 2004 Elsevier B.V. All rights reserved.
منابع مشابه
Binomial moments for divisible self-dual codes
For self-dual codes with all weights divisible by an integer greater than one, the minimum distance is bounded by the Mallows-Sloane upper bounds and by their improvements due to Krasikov-Litsyn and Rains. We obtain the improved upper bounds from short relations with constant coefficients on suitable binomial moments of the codes. In this approach, the Mallows-Sloane bounds are analogues of the...
متن کاملUpper Bound Analysis of Tube Extrusion Process Through Rotating Conical Dies with Large Mandrel Radius
In this paper, an upper bound approach is used to analyze the tube extrusion process through rotating conical dies with large mandrel radius. The material under deformation in the die and inside the container is divided to four deformation zones. A velocity field for each deformation zone is developed to evaluate the internal powers and the powers dissipated on all frictional and velocity disco...
متن کاملA Singleton Bound for Lattice Schemes
The binary coding theory and subspace codes for random network coding exhibit similar structures. The method used to obtain a Singleton bound for subspace codes mimic the technique used in obtaining the Singleton bound for binary codes. This motivates the question of whether there is an abstract framework that captures these similarities. As a first step towards answering this question, we use ...
متن کاملOn Quantum Hamming Bound
It is desirable to study upper and lower bounds on the minimum distance and dimensions of quantum codes, so the computer search on the code parameter can be minimized and optimal codes can be known. It is a well-known fact that Singleton and Hamming bounds hold for classical codes [9]. We need some bounds on the achievable minimum distance of a quantum stabilizer code. Perhaps the simplest one ...
متن کاملA Singleton Bound for Generalized Ferrers Diagram Rank Metric Codes
In this paper, we will employ the technique used in the proof of classical Singleton bound to derive upper bounds for rank metric codes and Ferrers diagram rank metric codes. These upper bounds yield the rank distance Singleton bound and an upper bound presented by Etzion and Silberstein respectively. Also we introduce generalized Ferrers diagram rank metric code which is a Ferrers diagram rank...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 286 شماره
صفحات -
تاریخ انتشار 2004